GNSS Outlier Mitigation via Graduated Non-Convexity Factor Graph Optimization
نویسندگان
چکیده
Accurate and globally referenced global navigation satellite system (GNSS) based vehicular positioning can be achieved in outlier-free open areas. However, the performance of GNSS significantly degraded by outlier measurements, such as multipath effects non-line-of-sight (NLOS) receptions arising from signal reflections buildings. Inspired advantage batch historical data resisting this paper, we propose a graduated non-convexity factor graph optimization (FGO-GNC) to improve performance, where impact outliers is mitigated estimating optimal weightings measurements. Different existing local solutions, proposed FGO-GNC employs non-convex Geman McClure (GM) function estimate measurements via coarse-to-fine relaxation. The effectiveness method verified through several challenging datasets collected urban canyons Hong Kong using automobile level low-cost smartphone receivers.
منابع مشابه
Graduated Non-Convexity by Smoothness Focusing
Noise-corrupted signals and images can be reconstructed by regularization. If discontinuities must be preserved in the reconstruction, a non-convex solution space is implied. The solution of minimum energy can be approximated by the Graduated Non-Convexity (GNC) algorithm. The GNC approximates the non-convex solution space by a convex solution space, and varies the solution space slowly towards...
متن کاملMatching Aerial Stereo Images Using Graduated Non Convexity Techniques
High resolution topographical data are used in many applications (urbanism, telecommunications ...). They include a Digital Elevation Model (DEM) of the scene and a description of man-made objects. They are usually derived from stereo images. The DEM is generally obtained from the disparity image which is computed using local correlations, whereas "man-made objects" are extracted by matching fe...
متن کاملGraduated Consistency-Regularized Optimization for Multi-graph Matching
Graph matching has a wide spectrum of computer vision applications such as finding feature point correspondences across images. The problem of graph matching is generally NP-hard, so most existing work pursues suboptimal solutions between two graphs. This paper investigates a more general problem of matching N attributed graphs to each other, i.e. labeling their common node correspondences such...
متن کاملNon-convexity, Discounting and Infinite Horizon Optimization
We consider the discounted aggregative model of optimal economic growth with non-convex production technology. We review some of the important results on the nature and long run behavior of optimal accumulation paths and indicate how these differ qualitatively from the ones in the classical convex version of the model.
متن کاملDeciding Graph non-Hamiltonicity via a Closure Algorithm
We present a matching and LP based heuristic algorithm that decides graph non-Hamiltonicity. Each of the n! Hamilton cycles in a complete directed graph on n + 1 vertices corresponds with each of the n! n-permutation matrices P, such that pu,i = 1 if and only if the ith arc in a cycle enters vertex u, starting and ending at vertex n + 1. A graph instance (G) is initially coded as exclusion set ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Vehicular Technology
سال: 2022
ISSN: ['0018-9545', '1939-9359']
DOI: https://doi.org/10.1109/tvt.2021.3130909